Round-Optimal Black-Box Statistically Binding Selective-Opening Secure Commitments
نویسنده
چکیده
Assuming t-round statistically hiding commitments in the stand-alone model, we build a (t+ 2)-round statistically binding commitment secure against selective opening attacks under parallel composition. In particular, assuming collisionresistant hash functions, we build such commitments in 4 rounds.
منابع مشابه
(Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks
Selective opening attacks against commitment schemes occur when the commitment scheme is repeated in parallel (or concurrently) and an adversary can choose depending on the commit-phase transcript to see the values and openings to some subset of the committed bits. Commitments are secure under such attacks if one can prove that the remaining, unopened commitments stay secret. We prove the follo...
متن کاملOn the round complexity of black-box constructions of commitments secure against selective opening attacks
Selective opening attacks against commitment schemes occur when the commitment scheme is repeated in parallel and an adversary can choose depending on the commit-phase transcript to see the values and openings to some subset of the committed bits. Commitments are secure under such attacks if one can prove that the remaining, unopened commitments stay secret. We prove the following black-box con...
متن کامل(Nearly) optimal black-box constructions of commitments secure against selective opening attacks
Selective opening attacks against commitment schemes occur when the commitment scheme is repeated in parallel (or concurrently) and an adversary can choose depending on the commit-phase transcript to see the values and openings to some subset of the committed bits. Commitments are secure under such attacks if one can prove that the remaining, unopened commitments stay secret. We prove the follo...
متن کاملErrata to (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure against Selective Opening Attacks
Selective opening attacks against commitment schemes occur when the commitment scheme is repeated in parallel (or concurrently) and an adversary can choose depending on the commit-phase transcript to see the values and openings to some subset of the committed bits. Commitments are secure under such attacks if one can prove that the remaining, unopened commitments stay secret. We prove the follo...
متن کاملRevisiting Lower and Upper Bounds for Selective Decommitments
In [DNRS99, DNRS03], Dwork et al. opened the fundamental question of existence of commitment schemes that are secure against selective opening attacks (SOA, for short). In [BHY09] Bellare, Hofheinz, and Yilek, and Hofheinz in [Hof11] solved this problem positively by presenting a scheme which is based on non-black-box use of a one-way permutation and which has superconstant number of rounds. Th...
متن کامل